Using Box Structures with the Z Notation
نویسندگان
چکیده
The Box Structure Method (BSM) provides a framework that can be used to introduce formality into the requirements speci cation stage of software development. A method of requirements speci cation is presented which integrates the Z notation with BSM. The requirements speci cation is con ned to the top level black box speci cation and the corresponding top level state box speci cation. We describe criteria for good requirements speci cation and we explain advantages of our integrated method for achieving them. Summary introductions are given to both BSM and Z followed by an examination of the relationship between the two methods. We explain our integrated method and illustrate it using a simple birthday reminder system. Finally, we discuss issues that have emerged from the use of this method and indicate areas for future research.
منابع مشابه
A New Comment on Reinforcement of Testing Criteria
This paper presents the formal aspects of testing criteria for Safety Critical Systems. A brief review of testing strategies i.e. white box and black box is given along with their various criteria’s. Z Notation; a formal specification language is used to sever the purpose of formalization. Initially, the schemas are formed for Statement Coverage (SC), Decision coverage (DC), Path Coverage (PC),...
متن کاملUsing Use Cases in Executable Z
Use Cases are a wide-spread informal method for specifying the requirements of a technical system in the early development phase. Z is a formal notation which aims to support, beside others, the specification of early requirements. In this paper, we develop a representation of Use Cases in Z and apply it to several examples. Our focus is on instrumenting the formalization for black-box test eva...
متن کامل18.783 Elliptic Curves: Lecture Notes 10
We now consider generic algorithms for the discrete logarithm problem. We shall assume throughout that N = |α| is known. This is a reasonable assumption, since there is a generic algorithm to compute N using o( √ N) group operations [9], which is strictly less than the complexity of any generic algorithm for this problem (we will prove an Ω( √ N) lower bound). The cyclic group 〈α〉 is isomorphic...
متن کاملDirectional Compactly supported Box Spline Tight Framelets with Simple Structure
To effectively capture singularities in high-dimensional data and functions, multivariate compactly supported tight framelets, having directionality and derived from refinable box splines, are of particular interest in both theory and applications. The d-dimensional Haar refinable function χ[0,1]d is a simple example of refinable box splines. For every dimension d ∈ N, in this paper we construc...
متن کاملDeriving Box-Spline Subdivision Schemes
Abstract. We describe and demonstrate an arrow notation for deriving box-spline subdivision schemes. We compare it with the z-transform, matrix, and mask convolution methods of deriving the same. We show how the arrow method provides a useful graphical alternative to the three numerical methods. We demonstrate the properties that can be derived easily using the arrow method: mask, stencils, con...
متن کامل